Efficient, XOR-Based, Ideal (t, n)- threshold Schemes
نویسندگان
چکیده
We propose a new, lightweight (t, n)−threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the scheme ideal. We provide a security proof and efficiency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more efficient than other schemes, especially when t is large.
منابع مشابه
Efficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud without Encryption
LDPC codes, LT codes, and digital fountain techniques have received significant attention from both academics and industry in the past few years. By employing the underlying ideas of efficient Belief Propagation (BP) decoding process in LDPC and LT codes, this paper introduces three classes of secret sharing schemes called BP-XOR secret sharing schemes, pseudo-BP-XOR secret sharing schemes, and...
متن کاملEfficient Constructions for t- (k, n)*-Random Grid Visual Cryptographic Schemes
In this paper we consider both “OR” and “XOR” based monochrome random grid visual cryptographic schemes (RGVCS) for t-(k, n)∗ access structure which is a generalization of the threshold (k, n) access structure in the sense that in all the successful attempts to recover the secret image, the t essential participants must always be present, i.e., a group of k or more participants can get back the...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputational Aspects of Ideal ( t , n ) - Threshold Scheme of Chen , Laing , and Martin
In CANS 2016, Chen, Laing, and Martin proposed an ideal (t, n)-threshold secret sharing scheme (the CLM scheme) based on random linear code. However, in this paper we show that this scheme is similar to the one proposed by Karnin, Greene, and Hellman in 1983 (the KGH scheme). Further, the authors did not analyzed memory or XOR operations required to either store or calculate an inverse matrix n...
متن کاملXOR-based Visual Cryptography Schemes
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show that n out of n schemes...
متن کامل